Spider: A robust curvature estimator for noisy, irregular meshes

نویسندگان

  • Patricio Simari
  • Karan Singh
  • Hans Pedersen
چکیده

Surface curvature properties are often as important as surface position in understanding shape. Curvature properties are typically computed at mesh vertices by operating on an associated ring neighbourhood of faces. Such approaches are not well suited to noisy, non-uniformly sampled meshes with irregular tessellations. In this paper, we present a principled approach to curvature estimation that can be computed at any point on the unprocessed mesh surface and is robust to noisy and irregular surface sampling and tessellation. The approach achieves user controlled smoothing of the curvature field thus also making it robust to noisy sampling. The nature of the smoothing, in contrast to current approaches, is determined by intuitive user-specified parameters and becomes naturally anisotropic in the vicinity of feature edges. We show this approach to provide better visual results than ring neighbourhood approaches on noisy, non-uniformly sampled meshes with irregular tessellations. CR Categories: I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling— [G.2.3]: Discrete Mathematics— Applications

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust statistical estimation of curvature on discretized surfaces

A robust statistics approach to curvature estimation on discretely sampled surfaces, namely polygon meshes and point clouds, is presented. The method exhibits accuracy, stability and consistency even for noisy, non-uniformly sampled surfaces with irregular configurations. Within an M-estimation framework, the algorithm is able to reject noise and structured outliers by sampling normal variation...

متن کامل

Normal Vector Voting: Crease Detection and Curvature Estimation on Large, Noisy Meshes

This paper describes a robust method for crease detection and curvature estimation on large, noisy triangle meshes. We assume that these meshes are approximations of piecewise-smooth surfaces derived from range or medical imaging systems and thus may exhibit measurement or even registration noise. The proposed algorithm, which we call normal vector voting, uses an ensemble of triangles in the g...

متن کامل

Robust Estimation of Curvature along Digital Contours with Global Optimization

In this paper we introduce a new curvature estimator based on global optimisation. This method called Global Min-Curvature exploits the geometric properties of digital contours by using local bounds on tangent directions defined by the maximal digital straight segments. The estimator is adapted to noisy contours by replacing maximal segments with maximal blurred digital straight segments. Exper...

متن کامل

Curvature estimation along noisy digital contours by approximate global optimization

In this paper we introduce a new curvature estimator along digital contours, that we called Global Min-Curvature estimator (GMC). As opposed to previous curvature estimators, it considers all the possible shapes that are digitized as this contour, and selects the most probable one with a global optimization approach. The GMC estimator exploits the geometric properties of digital contours by usi...

متن کامل

Curvature continuous bi-4 constructions for scaffold- and sphere-like surfaces

Scaffold surfaces bound geometric structures that have a dual characterization as a curve network and a solid. A subset of scaffold surfaces can be modeled with minimal single-valence (MSV) meshes, i.e. meshes consisting of vertices of a single irregular valence n two of which are separated by exactly one regular, 4-valent vertex. We present an algorithm for constructing piecewise biquartic sur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005